Gröbner bases and wavelet design
نویسندگان
چکیده
منابع مشابه
Gröbner bases and wavelet design
In this paper, we detail the use of symbolic methods in order to solve some advanced design problems arising in signal processing. Our interest lies especially in the construction of wavelet filters for which the usual spectral factorization approach (used for example to construct the well-known Daubechies filters) is not applicable. In these problems, we show how the design equations can be wr...
متن کاملMultiplicative Bases, Gröbner Bases, and Right Gröbner Bases
Before surveying the results of the paper, we introduce path algebras. Path algebras play a central role in the representation theory of finite-dimensional algebras (Gabriel, 1980; Auslander et al., 1995; Bardzell, 1997) and the theory of Gröbner bases (Bergman, 1978; Mora, 1986; Farkas et al., 1993) has been an important tool in some results (Feustel et al., 1993; Green and Huang, 1995; Bardze...
متن کاملCounting and Gröbner Bases
Gröbner bases were introduced by Buchberger (1965) and are now firmly established as a tool in Commutative Algebra and other areas. The reader is referred to Buchberger (1985), Cox, Little and O’Shea (1992) or Becker and Weispfenning (1993) for more information. Eisenbud (1995) places Gröbner bases within the context of more advanced Commutative Algebra. The ingredients for a Gröbner basis are ...
متن کاملRegular Gröbner Bases
In Ufnarovski (1989), the concept of automaton algebras is introduced. These are quotients of the non-commutative polynomial ring where the defining ideal allows some Gröbner basis with a regular set of leading words. However, nothing is reflected concerning the whole structure of the Gröbner basis (except of course for monomial algebras). In this paper we introduce the concept of regular Gröbn...
متن کاملComputing inhomogeneous Gröbner bases
In this paper we describe how an idea centered on the concept of self-saturation allows several improvements in the computation of Gröbner bases via Buchberger’s Algorithm. In a nutshell, the idea is to extend the advantages of computing with homogeneous polynomials or vectors to the general case. When the input data are not homogeneous, we use a technique described in Section 2: the main tool ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2004
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2002.06.002